#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    string s;
    cin >> s;
    int n = sz(s);
    s = ' ' + s;
    V<int> vis(n + 1, -1);
    V<int> pos;
    int idx = 0, cnt = 0;
    FOR(i, 1, n) {
        if (s[i] == '+') {
            pos.eb(++idx);
        } else if (s[i] == '-') {
            if (vis[pos.back()] == 0) cnt--;
            if (vis[pos.back()] == 1) {
                pos.pop_back();
                if (sz(pos)) vis[pos.back()] = 1;
                continue;
            }
            pos.pop_back();
        } else if (s[i] == '0') {
            if (sz(pos) < 2) {
                NO;
                RE;
            }

            if (vis[pos.back()] == -1) {
                vis[pos.back()] = 0;
                cnt++;
            }
            if (vis[pos.back()] == 1) {
                NO;
                RE;
            }

        } else {
            if (sz(pos) < 2) continue;
            if (cnt) {
                NO;
                RE;
            }

            if (vis[pos.back()] == -1) {
                vis[pos.back()] = 1;
            }
            if (vis[pos.back()] == 0) {
                NO;
                RE;
            }
        }
    }

    YES;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
